running time of an algorithm

См. также в других словарях:

• Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

• Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

• Randomized algorithm — Part of a series on Probabilistic data structures Bloom filter · Skip list …   Wikipedia

• Exponential time — In complexity theory, exponential time is the computation time of a problem where the time to complete the computation, m ( n ), is bounded by an exponential function of the problem size, n . In other words, as the size of the problem increases… …   Wikipedia

• Chan's algorithm — In computational geometry, Chan s algorithm, named after Timothy M. Chan, is an optimal output sensitive algorithm to compute the convex hull of a set P of n points, in 2 or 3 dimensional space. The algorithm takes O(n log h) time, where h is the …   Wikipedia

• Maze generation algorithm — Maze generation algorithms are automated methods for the creation of mazes. This maze generated by modified version of Prim s algorithm, below. Contents 1 Graph theory based methods …   Wikipedia

• Freivald's algorithm — is a randomized algorithm used to verify matrix multiplication. Given three n x n matrices A , B , and C , a general problem is to verify whether A x B = C . A naïve algorithm would compute the product A x B explicitly and compare term by term… …   Wikipedia

• Pollard's p - 1 algorithm — Pollard s p − 1 algorithm is a number theoretic integer factorization algorithm, invented by John Pollard in 1974. It is a special purpose algorithm, meaning that it is only suitable for integers with specific types of factors; it is the simplest …   Wikipedia

• Needleman-Wunsch algorithm — The Needleman–Wunsch algorithm performs a global alignment on two sequences (called A and B here). It is commonly used in bioinformatics to align protein or nucleotide sequences. The algorithm was published in 1970 by Saul Needleman and Christian …   Wikipedia

• CURE data clustering algorithm — CURE (Clustering Using REpresentatives) is an efficient data clustering algorithm for large databases that is more robust to outliers and identifies clusters having non spherical shapes and wide variances in size. Contents 1 Drawbacks of… …   Wikipedia

• De Boor's algorithm — In the mathematical subfield of numerical analysis the de Boor s algorithm is a fast and numerically stable algorithm for evaluating spline curves in B spline form. It is a generalization of the de Casteljau s algorithm for Bézier curves. The… …   Wikipedia